SOS-Convex Semialgebraic Programs and its Applications to Robust Optimization: A Tractable Class of Nonsmooth Convex Optimization
نویسندگان
چکیده
منابع مشابه
A Quasi-Newton Approach to Nonsmooth Convex Optimization A Quasi-Newton Approach to Nonsmooth Convex Optimization
We extend the well-known BFGS quasi-Newton method and its limited-memory variant (LBFGS) to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by generalizing three components of BFGS to subdifferentials: The local quadratic model, the identification of a descent direction, and the Wolfe line search conditions. We apply the resulting subLBFGS algorithm to L2-reg...
متن کاملInteger Optimization on Convex Semialgebraic Sets
Let Y be a convex set inRk defined by polynomial inequalities and equations of degree at most d ≥ 2 with integer coefficients of binary length at most l. We show that if the set of optimal solutions of the integer programming problem min{yk | y = (y1, . . . , yk) ∈ Y ∩Zk} is not empty, then the problem has an optimal solution y∗ ∈ Y ∩Zk of binary length ld O(k ). For fixed k, our bound implies ...
متن کاملA New Class of Alternative Theorems for SOS-Convex Inequalities and Robust Optimization∗
In this paper we present a new class of theorems of the alternative for SOS-convex inequality systems without any qualifications. This class of theorems provides an alternative equations in terms of sums of squares to the solvability of the given inequality system. A strong separation theorem for convex sets, described by convex polynomial inequalities, plays a key role in establishing the clas...
متن کاملDistributionally Robust Convex Optimization
Distributionally robust optimization is a paradigm for decision-making under uncertaintywhere the uncertain problem data is governed by a probability distribution that is itself subjectto uncertainty. The distribution is then assumed to belong to an ambiguity set comprising alldistributions that are compatible with the decision maker’s prior information. In this paper,we propose...
متن کاملRobust Convex Optimization
We study convex optimization problems for which the data is not specified exactly and it is only known to belong to a given uncertainty set U, yet the constraints must hold for all possible values of the data from U. The ensuing optimization problem is called robust optimization. In this paper we lay the foundation of robust convex optimization. In the main part of the paper we show that if U i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2017
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-017-0456-1